On Bar Recursion of Types 0 and 1
نویسنده
چکیده
For general information on bar recursion the reader should consult the papers of Spector [8], where it was introduced, Howard [2] and Tait [11]. In this note we shall prove that the terms of Godel's theory T (in its extensional version of Spector [8]) are closed under the rule BRo•1 of bar recursion of types 0 and 1. Our method of proof is based on the notion of an infinite term introduced by Tait [9]. The main tools of the proof are (i) the normalization theorem for (notations for) infinite terms and (ii) valuation functionals. Both are elaborated in [6]; for brevity some familiarity with this paper is assumed here. Using (i) and (ii) we reduce BRo.1 to ';-recursion with'; < co. From this the result follows by work of Tait [10], who gave a reduction of 2E-recursion to ';-recursion at a higher type. At the end of the paper we discuss a perhaps more natural variant of bar recursion introduced by Kreisel in [4]. Related results are due to :&reisel (in his appendix to [8]), who obtains results which imply, using the reduction given by Howard [2] of the constant of bar recursion of type '0 to the rule of bar recursion of type (0 ~ '0) ~ '0, that T is not closed under the rule of bar recursion of a type oflevel ~ 2, to Diller [1], who gave a reduction of BRo.1 to ';-recursion with'; bounded by the least (V-critical number, and to Howard [3], who gave an ordinal analysis of the constant of bar recursion of type O. I am grateful to H. Barendregt, W. Howard and G. Kreisel for many useful comments and discussions. Recall that a functional F of type 0 ~ (0 ~ '0) ~ (J is said to be defined by (the rule of) bar recursion of type '0 from Yand functionals G, H of the proper types if
منابع مشابه
Coq as a Metatheory for Nuprl with Bar Induction
These past few years, we have been experimenting in Nuprl with versions of Brouwer’s Bar Induction principle. Until recently we had no formal proof that these rules are valid Nuprl reasoning principles. Thanks to our formalization of Nuprl’s metatheory in Coq, we can now rigorously check whether these principles are consistent with Nuprl. In this paper we present a proof, using our Coq framewor...
متن کاملAbstracts of the invited speakers
s of the invited speakers Dag Normann, University of Oslo, Norway Revisiting Transfinite Types In this talk I will reconstruct spaces of countable and uncountable transfinite types, this time using limit spaces. This approach turns out to give a better access to internal concepts of computability for such spaces. The talk will be a report on ongoing research. This research is rooted in earlier ...
متن کاملModified bar recursion
We introduce a variant of Spector’s bar recursion (called “modified bar recursion”) in finite types to give a realizability interpretation of the classical axiom of countable choice allowing for the extraction of witnesses from proofs of Σ1 formulas in classical analysis. As a second application of modified bar recursion we present a bar recursive definition of the fan functional. Moreover, we ...
متن کاملBar recursive encodings of tree ordinals
We ask the attention for a de nition schema from higher order subrecursion the ory called bar recursion Bar recursion originates with Spector where bar recursion of all nite types is shown to characterize the class of provably total re cursive functions of analysis This class has also been characterized by Girard as those functions which are de nable in the second order typed lambda calculus or...
متن کاملProof Mining in Subsystems of Analysis
This dissertation studies the use of methods of proof theory in extracting new information from proofs in subsystems of classical analysis. We focus mainly on ineffective proofs, i.e. proofs which make use of ineffective principles ranging from weak König’s lemma to full comprehension. The main contributions of the dissertation can be divided into four parts: (1) A discussion of how monotone fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 44 شماره
صفحات -
تاریخ انتشار 1979